A Novel Approach to Geometric Fitting of Implicit Quadrics
نویسندگان
چکیده
This paper presents a novel approach for estimating the geometric distance from a given point to the corresponding implicit quadric curve/surface. The proposed estimation is based on the height of a tetrahedron, which is used as a coarse but reliable estimation of the real distance. The estimated distance is then used for finding the best set of quadric parameters, by means of the Levenberg-Marquardt algorithm, which is a common framework in other geometric fitting approaches. Comparisons of the proposed approach with previous ones are provided to show both improvements in CPU time as well as in the accuracy of the obtained results.
منابع مشابه
Quadric splines
Surface rendering or point location on a surface can easier be accomplished in an implicit rather than parametric representation This observation has been the key motivation for developing piecewise algebraic splines In particular Dahmen and Guo used triangular segments of quadrics to build tangent plane continuous surfaces interpolating the vertices of a trian gular net with prescribed normals...
متن کاملProximity Queries between Convex Objects: An Interior Point Approach for Implicit Surfaces
In this paper, we present an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. The implicit surfaces considered include planes (polyhedra), quadrics, and generalizations of quadrics including superquadrics and hyperquadrics, as well as intersections of these surfaces. Exact distance computation algorithms are particul...
متن کاملA New Approach to Geometric Fitting
Geometric fitting — parameter estimation for data subject to implicit parametric constraints — is a very common sub-problem in computer vision, used for curve, surface and 3D model fitting, matching constraint estimation and 3D reconstruction under constraints. Although many algorithms exist for specific cases, the general problem is by no means ‘solved’ and has recently become a subject of con...
متن کاملTemplate-based Point Cloud Modeling for Building Model
We introduce a novel template-based modeling technique for 3D point clouds sampled from unknown buildings. The approach is based on a hierarchy algebraic template to fit noisy point clouds with sharp features. In the hierarchy template, the first-level, i.e., the lowest-level, contains three kinds of primitive geometries: plane, sphere, and cylinder. These primitive geometries are represented i...
متن کاملLeast Squares Fitting of Quadratic Curves and Surfaces
In computer vision one often fits ellipses and other conics to observed points on a plane or ellipsoids/quadrics to spacial point clouds. The most accurate and robust fit is obtained by minimizing geometric (orthogonal) distances, but this problem has no closed form solution and most known algorithms are prohibitively slow. We revisit this issue based on recent advances by S. J. Ahn, D. Eberly,...
متن کامل